排序方式: 共有99条查询结果,搜索用时 62 毫秒
61.
无线传感器网络路由算法面临着节省能量、延长网络寿命、提高可靠性等方面的挑战。提出了一种基于遗传的无线传感器网络路由算法。对算法中的算子编码、适应度函数设计、编码方式及参数选取进行了细致研究。仿真结果表明,本算法减少了能耗、延长了网络生存时间并提高了网络的可靠性。 相似文献
62.
This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
63.
64.
We investigate the problem of scheduling a fleet of vehicles to visit the customers located on a path to minimize some regular function of the visiting times of the customers. For the single‐vehicle problem, we prove that it is pseudopolynomially solvable for any minsum objective and polynomially solvable for any minmax objective. Also, we establish the NP‐hardness of minimizing the weighted number of tardy customers and the total weighted tardiness, and present polynomial algorithms for their special cases with a common due date. For the multivehicle problem involving n customers, we show that an optimal solution can be found by solving or O(n) single‐vehicle problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 34–43, 2014 相似文献
65.
为解决星际网络场景下的数据传输问题,提出了一种星际容延迟网络路由协议:利用节点的历史连接信息来预测该节点与其各个邻居节点的连接恢复时间;当两个位于同一个域的节点互相连接时,交换彼此的连接时间预测表,并据此决定是否需要使用对方作为中继节点;深空节点的存储资源常常受限,在进行路由选择时将节点的存储区消耗情况也纳入决策。使用NS2进行地-火通信场景仿真,使用一种改进的泛洪路由和一种仅选择网关节点作为下一跳选择的路由策略作对比。仿真结果表明相比其他两种协议,提高了14%的投递成功率并减少了50%的平均传输延迟,并更有效的利用了节点存储资源。 相似文献
66.
针对无线传感网中结点能量受限,提出了一种基于动态流能量高效的路由算法DFEERA(Dynamic Flow-based Energy-Efficient Routing Algorithm)。该算法通过在无线传感网内设置多个基站收集区域内传感器结点的数据流拓扑结构建立数据传输能量消耗模型,将该模型转换为最大流问题求解最优传输路径,作为某时期内结点数据传输路径。随着结点能量的消耗,动态调整该能量消耗模型重新规划路径,作为新的传输路径,从而平衡结点间的能量消耗,提高网络结点的存活率。仿真结果表明,与其他典型的路由算法相比,DFEERA能够更好地平衡结点的能耗,获得更高的能量消耗率和更长的网络生存期。 相似文献
67.
68.
69.
基于双路由单元研究了Space Wire总线的性能评价体系。研究中给出双路由单元的定义,推导基于双路由单元的路由系统的数据传输时间和资源耗费的计算方法;推导基于双路由单元的多路由拓扑系统的性能评价体系;采用蒙特卡洛模拟的方法建立双路由单元系统的模拟平台,仿真计算路由单元在不同接口配置情况下的性能。研究结果表明:基于双路由单元的传输时间和资源耗费指标能够评价Space Wire总线的性能;在不同接口配置时,存在一种最佳的配置方式使系统的性能达到最优。 相似文献
70.
本文基于双路由单元研究了SpaceWire总线的性能评价体系。研究中,首先给出了双路由单元的定义,推导了基于双路由单元的路由系统的数据传输时间和资源耗费的计算方法;其次推导了基于双路由单元的多路由拓扑系统的性能评价体系;然后采用蒙特卡洛模拟的方法建立了双路由单元系统的模拟平台,仿真计算了路由单元在不同接口配置情况下的性能。研究结果表明:基于双路由单元的传输时间和资源耗费指标能够评价SpaceWire总线的性能;并且在不同接口配置时,存在一种最佳的配置方式能够使得系统的性能达到最优。 相似文献